Asymptotically optimal neighbour sum distinguishing colourings of graphs

Consider a simple graph G = (V,E) and its proper edge colouring c with the elements of the set {1,2,…,k}. The colouring c is said to be neighbour sum distinguishing if for every pair of vertices u, v adjacent in G, the sum of colours of the edges incident with u is distinct from the corresponding sum for v. The smallest integer k for which such colouring exists is known as the neighbour sum distinguishing index of a graph and denoted by . The definition of this parameter, which makes sense for graphs containing no isolated edges, immediately implies that , where Δ is the maximum degree of G. On the other hand, it was conjectured by Flandrin et al. that for all those graphs, except for C₅. We prove this bound to be asymptotically correct by showing that . The main idea of our argument relays on a random assignment of the colours, where the choice for every edge is biased by so called attractors, randomly assigned to the vertices. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 776–791, 2015     

环状硅酸盐图的友好指数集

Let G be a graph with vertex set V(G) and edge set E(G). A labeling f : V(G) →Z2 induces an edge labeling f*: E(G) → Z2 defined by f*(xy) = f(x) + f(y), for each edge xy ∈ E(G). For i ∈ Z2, let vf(i) = |{v ∈ V(G) : f(v) = i}| and ef(i) = |{e ∈ E(G) : f*(e) =i}|. A labeling f of a graph G is said to be friendly if |vf(0)- vf(1)| ≤ 1. The friendly index set of the graph G, denoted FI(G), is defined as {|ef(0)- ef(1)|: the vertex labeling f is friendly}. This is a generalization of graph cordiality. We investigate the friendly index sets of cyclic silicates CS(n, m).     

Forwarding and optical indices of 4-regular circulant networks

An all-to-all routing in a graph G is a set of oriented paths of G, with exactly one path for each ordered pair of vertices. The load of an edge under an all-to-all routing R is the number of times it is used (in either direction) by paths of R, and the maximum load of an edge is denoted by $\pi (G,R)$. The edge-forwarding index $\pi (G)$ is the minimum of $\pi (G,R)$ over all possible all-to-all routings R, and the arc-forwarding index $\overrightarrow{\pi }(G)$ is defined similarly by taking direction into consideration, where an arc is an ordered pair of adjacent vertices. Denote by $w(G,R)$ the minimum number of colours required to colour the paths of R such that any two paths having an edge in common receive distinct colours. The optical index $w(G)$ is defined to be the minimum of $w(G,R)$ over all possible R, and the directed optical index $\overrightarrow{w}(G)$ is defined similarly by requiring that any two paths having an arc in common receive distinct colours. In this paper we obtain lower and upper bounds on these four invariants for 4-regular circulant graphs with connection set $\{\pm 1,\pm s\}$, $1<s<n/2$. We give approximation algorithms with performance ratio a small constant for the corresponding forwarding index and routing and wavelength assignment problems for some families of 4-regular circulant graphs.     

Homoclinic orbits for first order Hamiltonian systems with some twist conditions

In this paper, we study the nonperiodic first-order Hamiltonian system ù = J L(t)u +J H(t, u), where H ∈ C1(R × R2n). With some assumptions on L, the corresponding Hamiltonian operator has only discrete spectrum. By using the index theory for self-adjoint operator equation,we establish the existence of multiple homoclinic orbits for the asymptotically quadratic nonlinearty satisfying some twist conditions between infinity and origin.     

Signal enhancement of a novel multi-address coding lidar backscatters based on a combined technique of demodulation and wavelet de-noising

Multi-address coding (MAC) lidar is a novel lidar system recently developed by our laboratory. By applying a new combined technique of multi-address encoding, multiplexing and decoding, range resolution is effectively improved. In data processing, a signal enhancement method involving laser signal demodulation and wavelet de-noising in the downlink is proposed to improve the signal to noise ratio (SNR) of raw signal and the capability of remote application. In this paper, the working mechanism of MAC lidar is introduced and the implementation of encoding and decoding is also illustrated. We focus on the signal enhancement method and provide the mathematical model and analysis of an algorithm on the basis of the combined method of demodulation and wavelet de-noising. The experimental results and analysis demonstrate that the signal enhancement approach improves the SNR of raw data. Overall, compared with conventional lidar system, MAC lidar achieves a higher resolution and better de-noising performance in long-range detection.     

防空导弹自动驾驶仪测试性建模研究与应用

为了得到防空导弹自动驾驶仪的故障检测与诊断策略,减少自动驾驶仪的测试费用,建立了自动驾驶仪的测试性模型并进行分析,解决了建模的难点。通过多层抽象混合推理故障建模方法推导了自动驾驶仪结构与测试点之间的关系,根据测试点的特征和自动驾驶仪工作原理建立信息流模型,在此基础上,利用故障与测试间的相关性矩阵来描述测试性模型。基于此模型设计了诊断策略构建方法。实际应用表明,建立测试性模型的方法完全正确,通过模型能够构建有效的检测与诊断策略,缩短测试时间。     

基于状态指标的更新决策方法研究

针对设备在实际运行和执行任务时经常涉及到维修、更新报废等管理活动缺乏定量模型支撑的问题,提出了利用典型部件的预测寿命和非典型部件的历史寿命对设备系统级的健康状态进行综合评估的方法,建立了一种以状态指标为决策序列的动态规划更新决策方法。该方法能综合考虑维修费用和更新费用,确定最优更新决策,降低保障费用,有效的提高了设备的经济效益。最后经过案例分析证明了该方法的有效性,对于提高设备的保障能力和经济效益提供了理论支撑和方法指导。     

多值测试诊断策略优化设计

针对电子系统中多值测试条件下的测试排序问题,提出了一种诊断策略优化方法。首先,以相关性矩阵模型为基础,将已有的二值测试的优化算法同多值测试问题相结合,提出了适用于多值测试的基于霍夫曼编码的启发式函数;其次,将平均测试代价最小和平均测试步骤最少作为优化目标,采用与或树启发式搜索算法生成诊断树,得到多值测试的诊断策略,并给出了诊断策略优化方法的具体实现步骤;最后,将其应用到航空设备的实例中。结果表明提出的基于霍夫曼编码的与或树启发式搜索算法是可行的,其生成的诊断树是最优的,比基于信息熵的与或树启发式搜索算法具有更小的平均测试代价和更少的平均测试步骤。